A DPLL-based High-Concurrent SAT Solver with FPGA
نویسندگان
چکیده
منابع مشابه
Reducing Compilation Time of Zhong's FPGA-Based SAT Solver
We present schemes to reduce the compilation time of conngurable hardware that solves Boolean Satiss-ability. The SAT solver presented by Zhong in last year's FCCM conference has a large compilation time overhead mainly due to placement and routing of many FPGAs. We attack the problem on 3 fronts. First, we partitioning the SAT solver into instance-speciic and instance non-speciic components. S...
متن کاملConcurrent-distributed programming techniques for SAT using DPLL-stålmarck
This paper reports our work on application of concurrent/distributed techniques to SAT. These were investigated using each of the following methods: the DPLL [5] algorithm, the dilemma rule of the Stålmarck’s algorithm [12] and a concurrent/distributed hybrid SAT solver: DPLL-Stålmarck, using a combination of the DPLL and the dilemma rule based algorithm. The prototypes have been implemented us...
متن کاملAn FPGA-Based SAT Solver Architecture with Near-Zero Synthesis and Layout Overhead
In this work we have developed a completely new and novel SAT solver architecture to address three fundamental hurdles blocking the way to a wider application of reconfigurablehardware-based acceleration of SAT, namely, (1) the time overhead of compiling the instance-specific circuit to hardware, (2) the limited sophistication of the hardware algorithm, and (3) the slow clock speeds. The main e...
متن کاملDPLL with a Trace: From SAT to Knowledge Compilation
We show that the trace of an exhaustive DPLL search can be viewed as a compilation of the propositional theory. With different constraints imposed or lifted on the DPLL algorithm, this compilation will belong to the language of d-DNNF, FBDD, and OBDD, respectively. These languages are decreasingly succinct, yet increasingly tractable, supporting such polynomial-time queries as model counting an...
متن کاملAnalysing Constraint Grammars with a SAT-solver
We describe a method for analysing Constraint Grammars (CG) that can detect internal conflicts and redundancies in a given grammar, without the need for a corpus. The aim is for grammar writers to be able to automatically diagnose, and then manually improve their grammars. Our method works by translating the given grammar into logical constraints that are analysed by a SAT-solver. We have evalu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/cii2017/17240